Nuprl Lemma : R-compat-Dsys 11,40

n:A:Realizer.
(R-size(A n)
 R-Feasible(A)
 (([[A]]  Dsys)
 c (B:Realizer. (R-size(B n R-Feasible(B A || B  [[A]] || [[B]])) 
latex


DefinitionsY, A || B, , {T}, SQType(T), Top, x,y,z,w,vt(x;y;z;w;v), x,y,z,u,v,wt(x;y;z;u;v;w), x,y,zt(x;y;z), x,y,z,wt(x;y;z;w), True, if b then t else f fi , tt, ff, xt(x), Rplus?(x1), b, R-size(R), i  j , False, A, A  B, t  T, A c B, P  Q, x:AB(x), , Rnone?(x1), Rplus-right(x1), Rplus-left(x1), P  Q, P & Q, R-Feasible(R), x(s1,s2,s3,s4,s5), x(a,b,c,d,e,f), x(s1,s2,s3), x(s1,s2,s3,s4), x(s), Unit, Realizer, P  Q, Dec(P), , , Rrframe(loc;x;L), Rbframe(loc;k;L), Raframe(loc;k;L), Rpre(loc;ds;a;p;P), Rsends(ds;knd;T;l;dt;g), Reffect(loc;ds;knd;T;x;f), Rsframe(lnk;tag;L), Rframe(loc;T;x;L), Rinit(loc;T;x;v), left  right, Rnone(),
LemmasR-compat-base, R-size-base, dsys-compatible-join, dsys-compatible-join2, R-compat-symmetry, decidable assert, assert of bnot, eqff to assert, bnot wf, assert wf, iff transitivity, eqtt to assert, bool sq, Rplus? wf, bool cases, Rplus-right wf, Rplus-left wf, m-sys-join wf2, R-size-decreases, R-Dsys-Rplus, Rplus-implies, es realizer ind wf, not wf, bool wf, finite-prob-space wf, decl-type wf, decl-state wf, fpf wf, IdLnk wf, Knd wf, rationals wf, Id wf, unit wf, R-Dsys-base-wf, decidable le, ge wf, nat properties, es realizer wf, nat plus wf, le wf, R-Feasible wf, R-compat wf, R-size wf, nat wf

origin